Parallel Processing of Conjugate Gradient Method Preconditioned with Wavelets.
نویسندگان
چکیده
منابع مشابه
Analysis of Parallel Preconditioned Conjugate Gradient Algorithms
The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on...
متن کاملSuperresolution Using Preconditioned Conjugate Gradient Method
In this paper we present a fast iterative image superresolution algorithm using preconditioned conjugate gradient method. To avoid explicitly computing the tolerance in the inverse filter based preconditioner scheme, a new Wiener filter based preconditioner for the conjugate gradient method is proposed to speed up the convergence. The circulant-block structure of the preconditioner allows effic...
متن کاملThe Multigrid Preconditioned Conjugate Gradient Method
multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wave length components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an e cient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition...
متن کاملPreconditioned Conjugate Gradient
.. ................................................................................................................... ix Chapter 1. Introduction ..................................................................................................1 Chapter 2. Background ..................................................................................................6 2.1. Matrix Compu...
متن کاملPreconditioned Conjugate Gradient Schemes
The conjugate gradient method is a powerful algorithm to solve well-structured sparse linear systems that arise from partial diierential equations. We consider here three diierent conjugate gradient schemes for solving elliptic partial diierential equations that arise from 5-point diierence schemes: the classical CG, CG with a block diagonal-block incomplete Cholesky preconditioner and the redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series B
سال: 1997
ISSN: 0387-5016,1884-8346
DOI: 10.1299/kikaib.63.1585